翻訳と辞書 Words near each other ・ Symmetric closure ・ Symmetric cone ・ Symmetric convolution ・ Symmetric decreasing rearrangement ・ Symmetric derivative ・ Symmetric difference ・ Symmetric digital subscriber line ・ Symmetric equilibrium ・ Symmetric federalism ・ Symmetric function ・ Symmetric game ・ Symmetric graph ・ Symmetric group ・ Symmetric Hash Join ・ Symmetric hydrogen bond ・ Symmetric hypergraph theorem ・ Symmetric in Design ・ Symmetric inverse semigroup ・ Symmetric level-index arithmetic ・ Symmetric matrix ・ Symmetric mean absolute percentage error ・ Symmetric monoidal category ・ Symmetric multiprocessing ・ Symmetric multiprocessor system ・ Symmetric obstruction theory ・ Symmetric Phase Recording ・ Symmetric polynomial ・ Symmetric probability distribution ・ Symmetric product ・ Symmetric product of an algebraic curve Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Symmetric hypergraph theorem ： ウィキペディア英語版 Symmetric hypergraph theorem The Symmetric hypergraph theorem is a theorem in combinatorics that puts an upper bound on the chromatic number of a graph (or hypergraph in general). The original reference for this paper is unknown at the moment, and has been called folklore.〔R. Graham, B. Rothschild, J. Spencer. Ramsey Theory. 2nd ed., Wiley, New-York, 1990.〕 ==Statement== A group $G$ acting on a set $S$ is called ''transitive'' if given any two elements $x$ and $y$ in $S$, there exists an element $f$ of $G$ such that $f(x)\; =\; y$. A graph (or hypergraph) is called ''symmetric'' if its automorphism group is transitive. Theorem. Let $H\; =\; (S,\; E)$ be a symmetric hypergraph. Let $m\; =\; |S|$, and let $\backslash chi(H)$ denote the chromatic number of $H$, and let $\backslash alpha(H)$ denote the independence number of $H$. Then 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Symmetric hypergraph theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.